The Complexity of Model Aggregation

Wp show that the l)robhun of transforming a structured Marker decision process (MDP) into Bounded Interval MDP is coNppr’-hacd. In particular, the test for e-homogvneitv, a ne(’essarv part of verifying mlv ̄ . ̄ . . p’p ~ ’" . . : prol)osed part.Ilion, ts coNP -complete. Tlus mallcatt,s thai., without furl,her assumptions on tile sorts uf partil.ioning allowrd or the structure of the original prt~positional MDP, this is not likely to be a prm:ticM approach. I, Vo also anMyze the coniplexity of finding tilt, ntinintal-size partition, and of the k-block partition existence problem. Finally, we show that tile test fi)r homogeneity of an exact partition is complete for coN P(’-P, which is the same class as coNP Pp. All of this mlalysis ,tpplies equally well to the process of p~trtitioning the state space via Structured Value Itoratitm.